|
課程名稱 |
演算法設計方法論
Design Strategies for Computer Algorithms |
|
開課學期 |
103-1 |
|
授課對象 |
電機資訊學院 資訊工程學研究所 |
|
授課教師 |
陳健輝 |
|
課號 |
CSIE7130 |
|
課程識別碼 |
922 U1810 |
|
班次 |
|
|
學分 |
3 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期四3,4,@(10:20~) |
|
上課地點 |
資105 |
|
備註 |
總人數上限：50人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
Greedy Methods
?Divide-and-Conquer
?Binary Tree Methods
?Prune-and-Search
?Dynamic Programming
?Tree Searching Strategies
(including, Backtracking,
Branch-and-Bound, and A*)
?Computational Geometry
(including, Plane Sweep and
Geometric Transformation)
?Parallel Algorithms
(including, Recursive Doubling,
Euler Tour Technique, Techniques of
Using Fewer processors and Spending
Less Time, and Configurational
Computation)
?Randomized Algorithms
?On-Line Algorithms
|
|
課程目標 |
Greedy Methods
?Divide-and-Conquer
?Binary Tree Methods
?Prune-and-Search
?Dynamic Programming
?Tree Searching Strategies
(including, Backtracking,
Branch-and-Bound, and A*)
?Computational Geometry
(including, Plane Sweep and
Geometric Transformation)
?Parallel Algorithms
(including, Recursive Doubling,
Euler Tour Technique, Techniques of
Using Fewer processors and Spending
Less Time, and Configurational
Computation)
?Randomized Algorithms
?On-Line Algorithms
|
|
課程要求 |
|
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
|
|
參考書目 |
Textbook: Introduction to the Design and Analysis of Algorithms,
R. C. T. Lee, S. S. Tseng, R. C. Chang and
Y. T. Tsai, McGraw-Hill
|
|
評量方式
(僅供參考) |
|
|